Что (кто) такое graph rewriting - определение
Graph rewriting
![optimization]] from compiler construction: multiplication with 2 replaced by addition). ''Bottom:'' Application of the rule to optimize "y=x*2" into "y=x+x".](https://commons.wikimedia.org/wiki/Special:FilePath/GraphRewriteExample color.png?width=200 "optimization]] from compiler construction: multiplication with 2 replaced by addition). ''Bottom:'' Application of the rule to optimize \"y=x*2\" into \"y=x+x\".")
TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH
Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting
In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation.
graph rewriting system
TECHNIQUES FOR ALGORITHMICALLY CREATING A NEW GRAPH FROM AN EXISTING GRAPH
Graph grammar; Graph transformation; Hypergraph grammar; Graph rewriting system; Term graph rewriting; Determinate graph rewriting
An extension of a term rewriting system which uses {graph
reduction} on terms represented by directed graphs to avoid
duplication of work by sharing expressions.
Double pushout graph rewriting
GRAPH REWRITING FRAMEWORK
User:Ɯ/Double pushout graph rewriting; Double-pushout approach
In computer science, double pushout graph rewriting (or DPO graph rewriting) refers to a mathematical framework for graph rewriting. It was introduced as one of the first algebraic approaches to graph rewriting in the article "Graph-grammars: An algebraic approach" (1973).
